Optimizing Milk Run and Use of Bin-Packing in Waste Collection Problems
نویسندگان
چکیده
منابع مشابه
Evolutionary Approach for Optimizing 3D Heterogeneous Bin Packing Problems
This paper presents a combinational Hybrid Genetic Algorithm (HGA) with packing tuning approach for solving Three Dimensional (3D) Single container arbitrary sized heterogeneous bin packing optimization problem, by considering practical constraints in the shipment container loading industries. Aim of this paper is to (i) pack 3D arbitrary sized heterogeneous bins in to a container. (ii) Improve...
متن کاملGeneralized Bin Packing Problems
Original Citation: Baldi M.M. Generalized Bin Packing Problems. In: 4OR. ISSN 1619-4500 (In Press) Availability: This version is available at : http://porto.polito.it/2523486/ since: December 2013 Publisher: Springer Published version: DOI:10.1007/s10288-013-0252-1 Terms of use: This article is made available under terms and conditions applicable to Open Access Policy Article ("Public All right...
متن کاملCollection and recycle bin location-allocation problem in solid waste management: A review
This comprehensive work explores the research performed inoptimization of the collection bin and in recycle bin location-allocation issues in solidwaste management. Although the collection phase of solid waste management accountsfor a significant proportion of the municipal budget, it has attracted only limitedattention of the researchers. Optimization of the collection bin and recycle bin loca...
متن کاملCollection and recycle bin location-allocation problem in solid waste management: A review
This comprehensive work explores the research performed inoptimization of the collection bin and in recycle bin location-allocation issues in solidwaste management. Although the collection phase of solid waste management accountsfor a significant proportion of the municipal budget, it has attracted only limitedattention of the researchers. Optimization of the collection bin and recycle bin loca...
متن کاملComparing online algorithms for bin packing problems
The relative worst-order ratio is a measure of the quality of online algorithms. In contrast to the competitive ratio, this measure compares two online algorithms directly instead of using an intermediate comparison with an optimal offline algorithm. In this paper, we apply the relative worst-order ratio to online algorithms for several common variants of the bin packing problem. We mainly cons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering & Technology
سال: 2018
ISSN: 2227-524X
DOI: 10.14419/ijet.v7i4.10.21285